題目

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

• The number of elements initialized in nums1 and nums2 are m and n respectively.
• You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.

題意

給定兩個排序過的陣列nums1,nums2，將nums2合併至nums1內。

-10^9 <= nums1[i], nums2[i] <= 10^9
nums1.length == m + n
nums2.length == n

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3

Output: [1,2,2,3,5,6]

解題想法

先將nums2合併至nums1內，
再使用氣泡排序法排序。

Solution

var merge = function (nums1, m, nums2, n) {
  let index = 0;
  for (let i = m; i < nums1.length; i++) {
    nums1[i] = nums2[index];
    index++;
  }
  for (let i = 0; i < nums1.length; i++) {
    for (let j = 0; j < nums1.length - i - 1; j++) {
      if (nums1[j] > nums1[j + 1]) {
        let temp = nums1[j];
        nums1[j] = nums1[j + 1];
        nums1[j + 1] = temp;
      }
    }
  }
  return nums1;
};